Towards Parametrizing Logic Program Analysis: Two Examples

نویسنده

  • Lunjin Lu
چکیده

A parametric analysis is an analysis whose input and output are parametrized with a number of parameters which can be instantiated to abstract properties after analysis is completed. This paper proposes to use Cousot and Cousot’s Cardinal power domain to capture dependencies of analysis output on its input and obtain a parametric analysis by parametrizing a base analysis. We illustrate the method by parametrizing Pos-based groundness dependency and set sharing analyses of logic programs. Experiments with a prototype analyzer shows that generality of the two resulting parametric analyses comes with a small extra cost.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parametrizing Program Analysis by Lifting to Cardinal Power Domains

A parametric analysis is an analysis whose input and output are parametrized with a number of parameters which can be instantiated to abstract properties after analysis is completed. This paper proposes to use Cousot and Cousot’s Cardinal power domain to capture functional dependencies of analysis output on its input and obtain a parametric analysis by parametrizing a non-parametric base analys...

متن کامل

Towards a Logic for Reasoning About Logic Programs Transformation

We give a proof-theoretic analysis of logic programs transformations , viewed as operations on proof trees in the sense of 3, 4, 9, 10]. We present a logic for reasoning about (equivalence preserving) transformations of logic programs. Our main tool is the usage of inference rules; the target program may be obtained as a set of clause introduction proofs with axioms from the source program. The...

متن کامل

JuS: Squeezing the Sense out of JavaScript Programs

We introduce JuS (JavaScript under Scrutiny), a first step towards a static-analysis tool for JavaScript based on a program logic in the style of separation logic. In particular, we focus on reasoning automatically about the JavaScript variable store. Because of prototype-based inheritance and with statements, even reasoning about variables is not trivial in JavaScript. We evaluate our tool on ...

متن کامل

The algebra of logic programming

At present, the field of declarative programming is split into two main areas based on different formalisms; namely, functional programming, which is based on lambda calculus, and logic programming, which is based on firstorder logic. There are currently several language proposals for integrating the expressiveness of these two models of computation. In this thesis we work towards an integratio...

متن کامل

Analogical Logic Program Synthesis from Examples

The purpose of this paper is to present a theory and an algorithm for analogical logic program synthesis from examples. Given a source program and examples, the task of our algorithm is to nd a program which explains the examples correctly and is similar to the source program. Although we can de ne a notion of similarity in various ways, we consider a class of similarities from the viewpoint of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • TPLP

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2013